package com.example.leetdemo.process;

import java.util.HashMap;
import java.util.Map;

public class Solution1405 {

    public String longestDiverseString(int a, int b, int c) {
        int all = a + b + c;
        int check = 0;
        StringBuilder stringBuilder = new StringBuilder();
        for (int i = 0; i < all; i++) {
            if (check != 2) {

            }
        }
        return "";
    }


    public static void main(String[] args) {
        Map<Long, String> map = new HashMap<>();
        map.put(101L, "111");
        map.get(null);
    }
}
